By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Optimization

Table of Contents
Search This Issue
Volume 8, Issue 2, pp. 287-630

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Tilt Stability of a Local Minimum

R. A. Poliquin and R. T. Rockafellar

pp. 287-299

BibTeX  Abstract Full Text:  PDF

A Chain Rule for Essentially Smooth Lipschitz Functions

Jonathan M. Borwein and Warren B. Moors

pp. 300-308

BibTeX  Abstract Full Text:  PDF

Null Sets and Essentially Smooth Lipschitz Functions

Jonathan M. Borwein and Warren B. Moors

pp. 309-323

BibTeX  Abstract Full Text:  PDF

Primal-Dual Interior-Point Methods for Self-Scaled Cones

Yu. E. Nesterov and M. J. Todd

pp. 324-364

BibTeX  Abstract Full Text:  PDF

On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming

Yin Zhang

pp. 365-386

BibTeX  Abstract Full Text:  PDF

Existence and Uniqueness of Search Directions in Interior-Point Algorithms for the SDP and the Monotone SDLCP

Masayuki Shida, Susumu Shindoh, and Masakazu Kojima

pp. 387-396

BibTeX  Abstract Full Text:  PDF

Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path

Gongyun Zhao

pp. 397-413

BibTeX  Abstract Full Text:  PDF

Existence of Solutions to Discrete Semicoercive Frictional Contact Problems

Anders Klarbring and Jong-Shi Pang

pp. 414-442

BibTeX  Abstract Full Text:  PDF

An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming

Chih-Jen Lin, Shu-Cherng Fang, and Soon-Yi Wu

pp. 443-456

BibTeX  Abstract Full Text:  PDF

The Linear l1 Estimator and the Huber M-Estimator

W. Li and J. J. Swetits

pp. 457-475

BibTeX  Abstract Full Text:  PDF

A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem

Pham Dinh Tao and Le Thi Hoai An

pp. 476-505

BibTeX  Abstract Full Text:  PDF

An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule

Paul Tseng

pp. 506-531

BibTeX  Abstract Full Text:  PDF

An Efficient Algorithm for Large-Scale Nonlinear Programming Problems with Simple Bounds on the Variables

R. Pytlak

pp. 532-560

BibTeX  Abstract Full Text:  PDF

Cost Approximation: A Unified Framework of Descent Algorithms for Nonlinear Programs

Michael Patriksson

pp. 561-582

BibTeX  Abstract Full Text:  PDF

Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization

Robert Mifflin, Defeng Sun, and Liqun Qi

pp. 583-603

BibTeX  Abstract Full Text:  PDF

Numerical Experience with Lower Bounds for MIQP Branch-And-Bound

Roger Fletcher and Sven Leyffer

pp. 604-616

BibTeX  Abstract Full Text:  PDF

Bicriterion Single Machine Scheduling with Resource Dependent Processing Times

T. C. Edwin Cheng, Adam Janiak, and Mikhail Y. Kovalyov

pp. 617-630

BibTeX  Abstract Full Text:  PDF